Observability and reconstructibility of bounded cellular automata

The aim of this article is to provide several ways assess the observability and reconstructibility bounded cellular automata (CA). First, generic definitions for considered CA their associated sensors are given, as well these measured dynamical systems. Criteria proposed linear affine through an extension Kalman criterion non-linear from results on Boolean networks. A method decentralised calculation presented in order reduce algorithmic complexity. These criteria analyzed illustrated examples, either with fixed or mobile sensors. Numerical methods related complexity issues discussed.